Modular construction of complete coalgebraic logics
نویسندگان
چکیده
منابع مشابه
Modular construction of complete coalgebraic logics
We present a modular approach to defining logics for a wide variety of state-based systems. The systems are modelled as coalgebras, and we use modal logics to specify their observable properties. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular fashion. Moreover, we show that the logics thus obtained inherit soundness, completeness a...
متن کاملModular Games for Coalgebraic Fixed Point Logics
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTLand PDL-like fixed points, and modular evaluation games. These results are generalisations of their correspondents in the modal μ-calculus, as described e.g. in [19]. Inspired by recent work of Venema [21], we provide our logics with evaluation games that come equipped...
متن کاملModular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, comple...
متن کاملModal Logics are Coalgebraic
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compos...
متن کاملExpressivity of finitary coalgebraic logics
We give a brief introduction to the theory of coalgebras and discuss the connection between coalgebra and modal logic. In the second more technical part of this paper summarizing known results we prove that the finitary version of Moss’ coalgebraic logic has the Hennessy-Milner property.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.06.002